A Genetic Algorithm for the Minimum Weight Triangulation
نویسندگان
چکیده
triangulation of points on a plane, called Genetic Minimum Weight Triangulation (GMWT for short), is presented based on the rationale of genetic algorithms. Polygon crossover and its algorithm for triangulations are proposed. New adaptive genetic operators, or adaptive crossover and mutation operators, are introduced. It is shown that the new method for the minimum weight triangulation can obtain more optimal results of triangulations than the greedy algorithm. 2 GENETIC MINIMUM WEIGHT TRIANGULATION In this paper, a new method for the minimum weight operators and the structure of GMWT are introduced. In
منابع مشابه
Minimum Weight Pseudo-Triangulations
We consider the problem of computing a minimum weight pseudo-triangulation of a set S of n points in the plane. We first present an O(n log n)-time algorithm that produces a pseudo-triangulation of weight O(wt(M(S)) · log n) which is shown to be asymptotically worstcase optimal, i.e., there exists a point set S for which every pseudotriangulation has weight Ω(log n · wt(M(S))), where wt(M(S)) i...
متن کاملA new asymmetric inclusion region for minimum weight triangulation
As a global optimization problem, planar minimum weight triangulation problem has attracted extensive research attention. In this paper, a new asymmetric graph called one-sided β-skeleton is introduced. We show that the one-sided circle-disconnected ( √ 2β)skeleton is a subgraph of a minimum weight triangulation. An algorithm for identifying subgraph of minimum weight triangulation using the on...
متن کاملOn exclusion regions for optimal triangulations
An exclusion region for a triangulation is a region that can be placed around each edge of the triangulation such that the region can not contain points from the set on both sides of the edge. We survey known exclusion regions for several classes of triangulations, including Delaunay, Greedy, and Minimum Weight triangulations. We then show an exclusion region of larger area than was previously ...
متن کاملApproximating the Minimum Weight Steiner Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtrees. In O(n log n) time we can compute a triangulation with O(n) new points, and no obtuse triangles, that approximates the MWST. We can also approximate the MWST with triangulations having no sharp angles. We generali...
متن کاملMinimum Weight Triangulation by Cutting Out Triangles
We describe a fixed parameter algorithm for computing the minimum weight triangulation (MWT) of a simple polygon with (n− k) vertices on the perimeter and k hole vertices in the interior, that is, for a total of n vertices. Our algorithm is based on cutting out empty triangles (that is, triangles not containing any holes) from the polygon and processing the parts or the rest of the polygon recu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004